Quasideterminant solutions of the extended noncommutative Kadomtsev–Petviashvili hierarchy

We construct a nonauto Darboux transformation for the extended noncommutative Kadomtsev–Petviashvili (ncKP) hierarchy and consequently derive its quasi-Wronskian solution. We also obtain the quasi-Wronskian solution of the ncKP equation with self-consistent sources (ncKPESCS) as a by-product. Finally, we use the direct verification method to prove the quasi-Wronskian solution of the ncKPESCS.     

On parakähler Hom-Lie algebras and Hom-left-symmetric bialgebras

In this paper, the parakähler Hom-Lie algebras or phase space of Hom-Lie algebras in terms of Hom-left-symmetric algebras are studied. A structure theory of parakähler Hom-Lie algebras in terms of matched pairs of Hom-Lie algebras is also presented. Besides, the bimodules of Hom-left-symmetric algebras are investigated. Furthermore, Hom-left-symmetric bialgebra which is precisely equivalent to parakähler Hom-Lie algebra is introduced. Especially, the coboundary Hom-left-symmetric bialgebra is considered.     

Gröbner–Shirshov bases for some Lie algebras

Siberian Mathematical Journal - We give Gröbner–Shirshov bases for the Drinfeld–Kohno Lie algebra L n in [1] and the Kukin Lie algebra A P in [2], where P is a semigroup. By way of...     

Hölder Continuity of the Saddle Point Set for Real-Valued Functions

This paper is concerned with Hölder continuity of the solution to a saddle point problem. Some new su?cient conditions for the uniqueness and Hölder continuity of the solution for a perturbed saddle point problem are established. Applications of the result on Hölder continuity of the solution for perturbed constrained optimization problems are presented under mild conditions. Examples are given to illustrate the obtained results.     

Algorithm of Barrier Objective Penalty Function

In this paper, an algorithm of barrier objective penalty function for inequality constrained optimization is studied and a conception–the stability of barrier objective penalty function is presented. It is proved that an approximate optimal solution may be obtained by solving a barrier objective penalty function for inequality constrained optimization problem when the barrier objective penalty function is stable. Under some conditions, the stability of barrier objective penalty function is proved for convex programming. Specially, the logarithmic barrier function of convex programming is stable. Based on the barrier objective penalty function, an algorithm is developed for finding an approximate optimal solution to an inequality constrained optimization problem and its convergence is also proved under some conditions. Finally, numerical experiments show that the barrier objective penalty function algorithm has better convergence than the classical barrier function algorithm.     

Cartesian Closed Extensions of Subcategories of CONT

In this paper we give a uniform way of proving cartesian closedness for many new subcategories of continuous posets. We define C-P to be the category of continuous posets whose D–completions are isomorphic to objects from C, where C is a subcategory of the category CONT of domains. The main result is that if C is a cartesian closed full subcategory of ALG _⊥ or BC, then C-P is also a cartesian closed subcategory of the category CONTP of continuous posets and Scott continuous functions. In particular, we have the following cartesian closed categories : BC-P, LAT-P, aL-P, aBC-P, B-P, aLAT-P, ω -B-P, ω -aLAT-P, etc.     

Structures of the twisted N = 1 Schrödinger–Neveu–Schwarz algebra

In this paper, we determine the universal central extension, derivation algebra and automorphism group of the twisted N = 1 Schrödinger–Neveu–Schwarz algebra. Furthermore, we generalize these results to the generalized twisted N = 1 Schrödinger–Neveu–Schwarz algebra in the final section.     

Estimation of potential gains from bank mergers: A novel two-stage cost efficiency DEA model

This paper develops a novel two-stage cost efficiency model to estimate and decompose the potential gains from Mergers and Acquisitions (M&As). In this model, a hypothetical DMU is defined as a combination of two or more candidate DMUs. The hypothetical DMU would surpass the traditional Production Possibility Set (PPS). In order to solve the problem, a Merger Production Possibility Set (PPS_M) is constructed. The model minimizes the total cost of the hypothetical DMU while maintaining its outputs at the current level, and estimates the overall merger efficiency by comparing its minimal total cost with its actual cost. Moreover, the overall merger efficiency could be decomposed into technical efficiency, harmony efficiency, and scale efficiency. We show that the model can be extended to a two-stage structure and these efficiencies can be decomposed to both sub-systems. To show the usefulness of the proposed approach, we applied it to a real dataset of top 20 most competitive Chinese City Commercial Banks (CCBs). We concluded that (1) there exist considerably potential gains for the proposed merged banks. (2) It is also shown that the main impact on potential merger gains are from technical and harmony efficiency. (3) As an interesting result we found that the scale effect works against the merger, indicating that it is not favorable for a full-scale merger.     

On heavy paths in 2-connected weighted graphs

A weighted graph is a graph in which every edge is assigned a non-negative real number. In a weighted graph, the weight of a path is the sum of the weights of its edges, and the weighed degree of a vertex is the sum of the weights of the edges incident with it. In this paper we give three weighted degree conditions for the existence of heavy or Hamilton paths with one or two given end-vertices in 2-connected weighted graphs.